Method and system using heuristics in performing batch updates of records

ABSTRACT

Computer method and apparatus processing batch changes to a plurality of records employs heuristics. The system includes a computer based source of a plurality of records subject to a batch update. Each record in the plurality has respective meta data information. A computer processor projects application of changes forming the batch update in one record of the plurality. The processor applies heuristics including noting metadata information of the one record impacting changes to each record in the plurality. Using the noted metadata information and heuristics, the system further projects application of the batch update changes to remaining records in the plurality. A preview display of the projected results of the batch changes allows the user to commit, modify or revert batch updates per record.

RELATED APPLICATION(S)

This application is a continuation of U.S. application Ser. No.12/823,785, filed Jun. 25, 2010. The entire teachings of the aboveapplication(s) are incorporated herein by reference.

BACKGROUND

Batch updating is a problem when a user needs to make the same orsimilar changes on multiple change requests (or bug records) by editinga single change request and then applying those changes to all requestsin the batch. The problem is figuring out how the changes from the firstchange request should be applied to all subsequent requests the way theuser intended. This is a problem often encountered in change request(bug tracking) systems where many change requests may need to be updatedat once, for example as part of iteration planning.

Mistakes in batch update can be extremely costly in terms of time andlost data. It is not uncommon for hundreds of change requests to bemisplaced or to be updated incorrectly. Batch update is often used whenperforming a triage on a backlog of requests, or moving several requestsinto the new iteration. Mistakes can cause these requests to getmisplaced, lost, or overwritten. Requests often contain valuableinformation like customer data, detailed descriptions, logs, etc.Usually users and administrators are left going through change requestsone by one, or restoring a database backup, when batch update issupposed to be a time saver.

A common solution is to simply copy the field values or the deltas fromthe first change request into subsequent requests, but this does notalways match the user's intent. Data is lost and productivity is lost byhaving to go back and fix forms that were incorrectly changed.

BRIEF SUMMARY

The present invention addresses the foregoing problems and shortcomingsof the art. In particular, the present invention employs heuristics inbatch updating of a plurality of database records, e.g., changerequests.

According to one embodiment of the present invention heuristics arebased upon form field type and context. The heuristics are used tofigure out the appropriate operation to perform on subsequent changerequests. Operations include replace, append, prepend, increment, etc.

The field operations can also be configurable such that operations canbe changed or added. These operations can also be scriptable where auser or administrator prepares a special operation for specific fields.For example, a script may be written to bring changes into a listingsuch that the final list maintains alphabetical order. In anotherexample, if examining a reference from one change request to anotherchange request, the default heuristic may overwrite the value. Inanother example, if dealing with a list of references to other changerequests, some heuristics may add or subtract these references. Or ifexamining a notes or discussion field, a heuristic may be to add newcomments only to relevant discussions or to at least make sure when newcomments are added that the notes remain properly formatted.

These operations are applied consistently across all requests in thebatch, or determined for each change request in the batch individually.Additionally, a batch update preview is created and enables a user toquickly see what will change and to then adjust, commit, or back outtheir batch update. The advantages of this system are that the changesthat are being made are smarter and more like those intended and wantedby the user. The user also has an opportunity to prevent mistakes anderrors before they actually happen.

In one embodiment a computer method or system processing batch changesto a plurality of records, comprises:

a digital processor obtaining a plurality of records subject to a batchupdate, each record in the plurality having respective metadatainformation;

a computer configured to project application of changes forming thebatch update in a first (i.e., any one) record of the plurality, saidprojecting including noting metadata information of the first (one)record impacting changes to each record in the plurality; and

using the noted metadata information, the computer projectingapplication of the batch update to remaining records in the plurality.

In accordance with one aspect of the present invention, the batch updatemay be formed of one or more operations. The plurality of records may bea collection of change requests. In other embodiments, the plurality ofrecords is a plurality of data base records.

In one embodiment, the method or system further comprises, for eachrecord, displaying a preview of the projected application of the batchupdate changes. The previewer or preview displayer further enables userinteraction with records and projected application of the batch updatechanges as displayed in the preview. The user interaction may includeany one or more of:

de-selection of the projected application of one or more or the batchupdate changes, the de-selection and adjustment may be on a per recordbasis or an all records basis;

adjustment of the projected application of one or more of the batchupdate changes; and

rewriting of one or more of the batch update changes in line of acertain record.

The system and method further comprise committing one or more of thebatch update changes in accordance with user command. Similarly, thesystem and method may comprise reverting one or more of the batch updatechanges in accordance with user command.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The foregoing will be apparent from the following more particulardescription of example embodiments of the invention, as illustrated inthe accompanying drawings in which like reference characters refer tothe same parts throughout the different views. The drawings are notnecessarily to scale, emphasis instead being placed upon illustratingembodiments of the present invention.

FIG. 1 is a schematic illustration of a preview screen in oneembodiment.

FIG. 2 is a schematic view of database records (e.g., change requests)in the embodiment of FIG. 3.

FIG. 3 is a block diagram of a computer device implementing oneembodiment of the present invention.

FIG. 4 is a network of computers of the FIG. 3 embodiment.

FIG. 5 is a flow diagram of one embodiment of the present invention.

DETAILED DESCRIPTION

Batch processing affects a collection of items, such as a plurality ofdatabase records. Generally a “batch update” applies a change or set ofchanges (such as add, delete, move or modify) similarly to each item inthe collection. For non-limiting example, a database of change requestrecords is discussed below although the present invention may apply toany domain that has a concept of updating more than one record or memberof a collection (plurality) at a time.

A non-limiting example database 94 of records (e.g., change requests) 15is illustrated in FIG. 2. Each change request is represented in database94 by a respective record 15. For each record 15, there are a number offields 19, 21, 23. Each field 19, 21, 23 holds a respective valueindicative of the change request 15. In addition to field value, thereare metadata per field that further defines or specifies attributes ofthe respective record and change request 15. The metadata may includefield data type (e.g., Boolean, character string/text, numeric, list,reference, etc.), field length (e.g., 1 bit, multi-bit, etc.) and dataformat (e.g., alphanumeric, n-point precision, bit switch, linked list,pointer, etc.).

Given a database 94 (FIGS. 2 and 3) of change requests/records 15 a, 15b, a user identifies certain ones to be treated in batch. That is, theplurality of identified records (change requests 15 in FIG. 1) forms abatch. The user defines or otherwise specifies the set of changes (batchoperations) 13 for this plurality, i.e., the batch update.

After the user has selected a batch of change requests 15 and hasspecified the desired changes (batch operations) 13, the inventionsystem 100 uses the desired changes (operations) 13 and the existingdata in the request records 15 as inputs into preconfigured or userdefined heuristics.

According to one embodiment of the present invention, the heuristics arebased upon field type and context, and help determine the appropriateoperation to perform on subsequent change requests 15. Operationsinclude replace, append, prepend, increment, etc. The field operationsare configurable so that operations can be changed or added. Theseoperations can also be scriptable where a user or administrator preparesa special operation for specific fields 19, 21, 23.

A non-limiting illustrative example set of heuristics is as follows. Ifthe record field 19, 21, 23 is a list holding data in alphabeticalorder, then after application of the changes (batch operations) 13, makenecessary changes to the final list to maintain alphabetical order. Ifexamining a reference from one change request (record) 15 to anotherchange request (record) 15, the default heuristic may overwrite thevalue. If dealing with a list of references to other change requests(records) 15, then some heuristics may add or subtract these references.Or if examining a notes or discussion field 19, 21, 23, then a heuristicmay add new comments only to relevant discussions or to at least makesure when new comments are added that the notes remain properlyformatted.

These operations (including heuristics) are applied consistently acrossall change requests/records 15 in the batch, or determined for eachchange request 15 in the batch individually. The system 100 attempts tobest match the changes (batch operations) 13 the user specifies to makeagainst the data that already exists in the record 15. After this time,the user is allowed an opportunity to manually intervene.

System 100 allows the user to directly adjust the final output values orto change the heuristics that are applied to be more in line with hisintent. At each step, the system 100 displays to the user a preview 17(FIG. 1) of the final outcome of the batch operation 13 and heuristicchanges/refinements. But the user is still able to back out (not committhe change/batch operation 13) at any time. Once the user chooses tocomplete the batch update operation 13, the changes (including userselected heuristic changes/refinements) are then committed to thedatabase 94.

With reference now to FIG. 1, one embodiment of the present invention isshown for purposes of illustration and not limitation. Shown at 13 b isone of the batch updates, the “multiple text changes” operation, desiredand specified by the user. The other listed batch updates 13 a, c inFIG. 1 are the “Change State to Closed” operation and the “AddAttachment c:\test.log” operation. The change request records 15 to beaffected by each listed batch update/operation 13 are indicated inoutline or hierarchical tree fashion underneath the operation name. Forexample, change requests “SAMPL 0000001” 15 a and “SAMPL 0000002” 15 bare indicated as respective nodes (leaves) under each listed batchupdate (operation) 13 entry or branch.

In the illustrated example, the user has selected change request record15 a “SAMPL 0000001” listed to be changed by “Multiple Text Changes”batch update 13 b.

In particular, the Description field of that record 15 a is beingmodified with insertion or new text and with new text appended. Inresponse to user selection of the text insertion change, the system 100displays a preview at 17 in FIG. 1. In the preview 17, the system 100displays the original field value/contents from the source record 15(i.e., original text of the Description field) and in a pane or windownext to that displays the result of the proposed text insertion change(subject batch operation) 13 b. The example results illustrate the newtext inserted between original lines of text of the Description field.

Known or common preview display techniques are used.

In another example, the user selects several change requests/records 15that are not assigned to any iteration, but need to be assigned to thenext iteration. In the first request/record 15 a, the user adjusts theiteration value and then chooses batch updates/operations 13 that add akeyword to a keywords field 19 a, and remove the last customer name froma customers field 21 associated with the change request 15 a.

The system 100 determines that the iteration value was changed, so thenchooses to change the iteration value for all subsequent records 15 b,n. The system 100 knows from field definitions metadata that thekeywords field 19 a is a list, and determines that since a new keywordwas added to this list it should add this keyword to the keywords field(list) 19 a of subsequent change requests/records 15 if it does notalready exist. The system 100 then determines from record metadata thatthe customers field 21 is a list and has had a customer name removed,and so choose to remove that customer name from respective customersfields 21 in subsequent change request records 15. Perhaps the currentiteration has a process rule that requires all change requests/records15 to have a reviewer. A custom operation could be predefined andapplied to the “Reviewer” field 23 such that an appropriate reviewer isselected for each change request 15 rather than reusing the reviewername from the first request record 15 a.

The system's 100 heuristics compute field dependencies and attempts toresolve them. But the system 100 also provides to the user anopportunity to review the suggested refined changes and satisfactorilyresolve any errors prior to committing the batch update 13. For example,change request records 15 for the new iteration may require the workestimate field 19 b to be filled in, but some of the records beingchanged may not have that field filled in. In response, the system 100projects an iteration value, but then presents a preview dialog 17 toallow the user to see the projected value and accept it or change it.

This preview dialog 17 allows a user to get a view of the changes, withannotations about how those changes were made or determined, andsupports allowing the user to make further adjustments to those changesas necessary. This can be similar to Eclipse's refactoring previewdialog where the user can adjust what file changes he wants to actuallyhave happen, and are provided an opportunity to back out before thechanges are actually written (electronically effected and stored). Thispreview dialog 17 may display all the change requests (records) 15 beingchanged and the individual field 19, 21,23 changes in a hierarchicalformat. In one embodiment, the user deselects changes (batch operations)13 he does not want to make, adjusts how the changes 13 are applied, orrewrites them inline for individual requests (records) 15 or all changerequests (records) 15. For example, instead of incrementing an integervalue, this dialog 17 allows the user to overwrite the integer value forall change requests 15 with the value from the first change request 15 aor to always remove the Nth customer from the customer field 21 ratherthan matching on a customer's name.

Once satisfied, the user using the preview dialog 17 may instantlyrevert or commit the batch update changes 13 with a touch of a button(or similar user command). Common techniques in the art are employed toaccomplish this.

FIG. 4 illustrates a computer network or similar digital processingenvironment in which the present invention may be implemented.

Client computer(s)/devices 50 and server computer(s) 60 provideprocessing, storage, and input/output devices executing applicationprograms and the like. Client computer(s)/devices 50 can also be linkedthrough communications network 70 to other computing devices, includingother client devices/processes 50 and server computer(s) 60.Communications network 70 can be part of a remote access network, aglobal network (e.g., the Internet), a worldwide collection ofcomputers, Local area or Wide area networks, and gateways that currentlyuse respective protocols (TCP/IP, Bluetooth, etc.) to communicate withone another. Other electronic device/computer network architectures aresuitable.

FIG. 3 is a diagram of the internal structure of a computer (e.g.,client processor/device 50 or server computers 60) in the computersystem of FIG. 4. Each computer 50, 60 contains system bus 79, where abus is a set of hardware lines used for data transfer among thecomponents of a computer or processing system. Bus 79 is essentially ashared conduit that connects different elements of a computer system(e.g., processor, disk storage, memory, input/output ports, networkports, etc.) that enables the transfer of information between theelements. Attached to system bus 79 is I/O device interface 82 forconnecting various input and output devices (e.g., keyboard, mouse,displays, printers, speakers, etc.) to the computer 50, 60. Networkinterface 86 allows the computer to connect to various other devicesattached to a network (e.g., network 70 of FIG. 4). Memory 90 providesvolatile storage for computer software instructions 92 and data 94 usedto implement an embodiment of the present invention (e.g., batch updatesystem 100 using heuristics, preview displayer 17 and supporting codedetailed above and below). Disk storage 95 provides non-volatile storagefor computer software instructions 92 and data 94 used to implement anembodiment of the present invention. Central processor unit 84 is alsoattached to system bus 79 and provides for the execution of computerinstructions.

In one embodiment, the processor routines 92 and data 94 are a computerprogram product (generally referenced 92), including a computer readablemedium (e.g., a removable storage medium such as one or more DVD-ROM's,CD-ROM's, diskettes, tapes, etc.) that provides at least a portion ofthe software instructions for the invention system. Computer programproduct 92 can be installed by any suitable software installationprocedure, as is well known in the art. In another embodiment, at leasta portion of the software instructions may also be downloaded over acable, communication and/or wireless connection. In other embodiments,the invention programs are a computer program propagated signal product107 embodied on a propagated signal on a propagation medium (e.g., aradio wave, an infrared wave, a laser wave, a sound wave, or anelectrical wave propagated over a global network such as the Internet,or other network(s)). Such carrier medium or signals provide at least aportion of the software instructions for the present inventionroutines/program 92.

In alternate embodiments, the propagated signal is an analog carrierwave or digital signal carried on the propagated medium. For example,the propagated signal may be a digitized signal propagated over a globalnetwork (e.g., the Internet), a telecommunications network, or othernetwork. In one embodiment, the propagated signal is a signal that istransmitted over the propagation medium over a period of time, such asthe instructions for a software application sent in packets over anetwork over a period of milliseconds, seconds, minutes, or longer. Inanother embodiment, the computer readable medium of computer programproduct 92 is a propagation medium that the computer system 50 mayreceive and read, such as by receiving the propagation medium andidentifying a propagated signal embodied in the propagation medium, asdescribed above for computer program propagated signal product.

Generally speaking, the term “carrier medium” or transient carrierencompasses the foregoing transient signals, propagated signals,propagated medium, storage medium and the like.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, inbaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wireline, optical fiber cable, RF, etc. or any suitable combination ofthe foregoing.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java, Smalltalk, C++ or the like and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer program instructions. These computer program instructions maybe provided to a processor of a general purpose computer, specialpurpose computer, or other programmable data processing apparatus toproduce a machine, such that the instructions, which execute via theprocessor of the computer or other programmable data processingapparatus, create means for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

Referring now to FIG. 5, a flow diagram of one embodiment 100 of thepresent invention is presented. System/process 100 begins with step 531identifying a first record 15 a of a plurality of records subject tobatch updates/changes 13. In response to the subject change (batchoperation) 13, step 533 determines the field 19, 21, 23 affected by thechange. Using the record metadata for this field 19, 21, 23, step 533notes pertinent factors such as data type and context, for non-limitingexample and refines the change as applied in an uncommitted state. Step533 executes applicable heuristics (as described above) which may beimplemented on a rules-basis or using other programming techniques inthe art. Step 533 notes metadata particulars and context for each change(batch operation) 13 being applied to the record 15 a.

Process passes to the next record 15 b in the plurality (batch) and step535 considers any noted factors generated by step 533 in processing thepreceding record 15 a. In particular, for the subject change/batchoperation 13, step 535 processes the respective field 19, 21, 23 incurrent record 15 b that corresponds to the noted and about to bechanged field(s) of the preceding record 15 a using noted and learnedfactors (including context) to this point. Step 535 similarly executesand applies heuristics.

A given batch operation 13 may have multiple steps/parts. For each partof a batch operation 13, steps 533 and 535 are repeated by loop(iteration decision) 537.

After processing the first two records 15 a, 15 b in the plurality, thenext record and succeeding records are iteratively processed at step539. Each succeeding record 15 is processed with respect toconsiderations and factors learned (noted) in the processing of thepreceding records. System 100 executes and applies heuristicsaccordingly.

The foregoing processing is displayed in preview 17 (FIG. 1). Step 541generates and supports preview display 17, including in response to userinteraction calling functions or operations 543. For non-limitingexample, operations 543 enable user de-selection of a displayedchange-to-be, user adjustment of a displayed change-to-be, userrewriting of a change inline, user script generation, and the like asdiscussed above. Known techniques for implementing operations 543 areutilized. At the end of process 100, by user-command, the system maycommit some or all changes/batch updates 13 and/or revert some or allbatch updates/changes 13 using known techniques.

Accordingly, system 100 provides for the use of heuristics in performingbatch updates 13 of change requests (a plurality of database records)15. The advantages of system 100 are that the batch changes that arebeing made are smarter and more like those intended and wanted by theuser. The user also has an opportunity to prevent mistakes and errorsbefore they occur.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a”, “an” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

While this invention has been particularly shown and described withreferences to example embodiments thereof, it will be understood bythose skilled in the art that various changes in form and details may bemade therein without departing from the scope of the inventionencompassed by the appended claims. For example, records and fields of arecord my have metadata defined by class or type of record. Then theclass or type effectively provides a template of the metadata that maybe utilized by embodiments of the present invention. Based on thetemplate of metadata, pertinent changes (batch updates) can be projectedaccording to the principles of the invention.

1. A computer method of processing batch changes to a plurality of records, comprising: using a digital processor, obtaining a plurality of records subject to a batch update, each record in the plurality having respective meta data information; projecting application of changes forming the batch update in a first record of the plurality, said projecting including noting metadata information of the first record impacting changes to each record in the plurality; and using the noted metadata information, projecting application of the batch update to remaining records in the plurality.
 2. A method of claim 1, wherein the batch update is formed of one or more operations.
 3. A method of claim 1, wherein the plurality of records is a collection of change requests.
 4. A method of claim 1, wherein the plurality of records is a plurality of data base records.
 5. A method of claim 1, further comprising: for each record, displaying a preview of the projected application of the batch update changes.
 6. A method of claim 5, further comprising: enabling user interaction with records and projected application of the batch update changes as displayed in the preview; said user interaction including any one or more of: de-selection of the projected application of one or more or the batch update changes; adjustment of the projected application of one or more of the batch update changes; and rewriting of one or more of the batch update changes in line of a certain record.
 7. The method of claim 6 where the de-selection and adjustment are on a per record basis or an all records basis.
 8. The method of claim 5 further comprising committing one or more of the batch update changes in accordance with user command.
 9. The method of claim 5 further comprising reverting one or more of the batch update changes in accordance with user command. 